package Task;
import java.util.*;
public class task3 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        scanner.nextLine();//消耗换行符
        String s = scanner.nextLine();
        scanner.close();
    }
    private static void reorder(String s){
        //统计每个字符的出现次数
        int[] count = new int[20];
        for (char c : s.toCharArray()) {
            count[ c - 'a']++;

        }
        //找到出现次数最多的字符
        int maxCount = 0;
        for (int val : count) {
            if (val > maxCount) {
                maxCount = val;
            }
        }
        //如果最多的字符出现次数大于（n+2）/2则无法重排
        if (maxCount > (s.length() + 1)/2) {
            System.out.println("no");

        }
        //构建结果字符串
        StringBuilder result = new StringBuilder();
        int left = 0;
        int right = result.length() - 1;
        boolean useLeft = true;
        while (left <= right){
            if (useLeft) {
                result.append(result.charAt(left++));
            }else{
                result.append(result.charAt(right--));

            }
            useLeft = ! useLeft;
        }
        System.out.println("yes\n" + result.toString());
    }

}
